Overview of the Algorithms for Solving the Multidimensional Knapsack Problems
نویسنده
چکیده
The multidimensional knapsack problem is defined as an optimization problem that is NP-hard combinatorial. The multidimensional knapsack problems have large applications, which include many applicable problems from different area, like cargo loading, cutting stock, bin-packing, financial and other management, etc. This paper reviews some researches published in the literature. The concentrate is on the different proposed algorithms as well as exact algorithms, and heuristic or metaheuristic algorithms. Keyword: Multidimensional knapsack problem; exact algorithms; heuristic
منابع مشابه
A dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملA Fuzzy Genetic Algorithm Based on Binary Encoding for Solving Multidimensional Knapsack Problems
The fundamental problem in genetic algorithms is premature convergence, and it is strongly related to the loss of genetic diversity of the population. This study aims at proposing some techniques to tackle the premature convergence by controlling the population diversity. Firstly, a sexual selection mechanism which utilizes the mate chromosome during selection is used. The second technique focu...
متن کاملNew trends in exact algorithmsfor the 0 - 1 knapsack
While the 1980s were focused on the solution of large sized \easy" knapsack problems , this decade has brought several new algorithms, which are able to solve \hard" large sized instances. We will give an overview of the recent techniques for solving hard knapsack problems, with special emphasis on the addition of cardinality constraints , dynamic programming, and rudimentary divisibility. Comp...
متن کاملParticle Swarm Optimization for the Multidimensional Knapsack Problem
The multidimensional knapsack problem (MKP) is a combinatorial optimization problem belonging to the class of NP-hard problems. This study proposes a novel self-adaptive check and repair operator (SACRO) combined with particle swarm optimization (PSO) to solve the MKP. The traditional check and repair operator (CRO) uses a unique pseudo-utility ratio, whereas SACRO dynamically and automatically...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کامل